Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
451	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
452	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
453	Scheduling Sport Tournaments using Constraint Logic Programming Andrea Schaerf Dipartimento di Informatica e Sistemistica Universit` a di Roma “La Sapienza” Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:14 Applied mathematics Mathematical optimization Combinatorial optimization Complexity classes Constraint logic programming Logic programming Constraint Matching Assignment problem Theoretical computer science Constraint programming Computational complexity theory
454	Oblivious and Non-Oblivious Local Search for Combinatorial Optimization by Justin Ward Add to Reading List Source URL: tspace.library.utoronto.ca Language: English - Date: 2013-01-07 16:15:02 Computational complexity theory Operations research Mathematical optimization Greedy algorithm Matroid theory Submodular set function Combinatorial optimization Optimization problem Algorithm Theoretical computer science Mathematics Applied mathematics
455	Human Resource Development Review http://hrd.sagepub.com Who or What Creates? A Conceptual Framework for Social Creativity Elizabeth Watson Add to Reading List Source URL: cogsci.uwaterloo.ca Language: English - Date: 2009-11-02 08:46:03 Educational psychology Positive psychology Problem solving Mind Psychology Cognitive science Computational creativity Aptitude Cognition Creativity
456	Lattice-based Cryptography Daniele Micciancio∗ Oded Regev† July 22, 2008 Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2008-07-22 12:40:02 Cryptography Lattice points Post-quantum cryptography Computational number theory Linear algebra Lattice-based cryptography Lattice problem Lattice SWIFFT Mathematics Algebra Abstract algebra
457	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
458	Advanced Algorithms – COMS31900Lecture 16 Approximation Algorithms (part one) P, NP and constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Applied mathematics NP-complete NP-hard P versus NP problem NP Polynomial-time reduction P Complete Reduction Theoretical computer science Computational complexity theory Complexity classes
459	Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010 Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2010-05-04 16:48:34 Complexity classes Computational resources Mathematical optimization Structural complexity theory Advice NTIME Probabilistically checkable proof NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
460	Defining lines of maximum probability for the design of patrol vessel itineraries Fernando Bação1 Victor Lobo2 1 ISEGI-UNL Add to Reading List Source URL: itcnt05.itc.nl Language: English - Date: 2008-09-22 04:53:24 NP-complete problems Operations research Neural networks Dimension reduction Travelling salesman problem Self-organizing map SOM NP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE